On partitions of finite vector spaces of low dimension over GF(2)

نویسندگان

  • Saad El-Zanati
  • G. F. Seelinger
  • Papa Sissokho
  • L. E. Spence
  • Charles Vanden Eynden
چکیده

Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained in exactly one subspace of P. If there exists a partition of Vn(q) containing ai subspaces of dimension ni for 1 ≤ i ≤ k, then (ak, ak−1, . . . , a1) must satisfy the Diophantine equation ∑k i=1 ai(q ni − 1) = q− 1. In general, however, not every solution of this Diophantine equation corresponds to a partition of Vn(q). In this article, we determine all solutions of the Diophantine equation for which there is a corresponding partition of Vn(2) for n ≤ 7.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partitions of finite vector spaces over GF(2) into subspaces of dimensions 2 and s

A vector space partition of a finite vector space V over the field of q elements is a collection of subspaces whose union is all of V and whose pairwise intersections are trivial. While a number of necessary conditions have been proved for certain types of vector space partitions to exist, the problem of the existence of partitions meeting these conditions is still open. In this note, we consid...

متن کامل

Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields

This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...

متن کامل

The lattice of finite subspace partitions

Let V denote V (n, q), the vector space of dimension n over GF(q). A subspace partition of V is a collection Π of subspaces of V such that every nonzero vector in V is contained in exactly one subspace belonging to Π. The set P(V ) of all subspace partitions of V is a lattice with minimum and maximum elements 0 and 1 respectively. In this paper, we show that the number of elements in P(V ) is c...

متن کامل

On Partitions of Finite vector Spaces

In this note, we give a new necessary condition for the existence of non-trivial partitions of a finite vector space. Precisely, we prove that the number of the subspaces of minimum dimension t of a non-trivial partition of Vn(q) is greater than or equal to q + t. Moreover, we give some extensions of a well known Beutelspacher-Heden’s result on existence of T -partitions.

متن کامل

Counting the Restricted Gaussian Partitions of a Finite Vector Space

A subspace partition Π of a finite vector space V = V (n, q) of dimension n over GF(q) is a collection of subspaces of V such that their union is V , and the intersection of any two subspaces in Π is the zero vector. The multiset TΠ of dimensions of subspaces in Π is called the type of Π, or, a Gaussian partition of V . Previously, we showed that subspace partitions of V and their types are nat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 309  شماره 

صفحات  -

تاریخ انتشار 2009